About Cardinality-based Possibilistic Queries against Possibilistic Databases
نویسندگان
چکیده
This paper deals with the querying of possibilistic relational databases, by means of possibilistic queries whose general form is: "to what extent is it possible that the answer to Q satisfies property P". Here, we consider cardinality-based queries (in this case, property P is about cardinality) for which a processing technique is proposed, which avoids computing all the worlds attached to the possibilistic database. .H\ZRUGV Ill-known values, possibilistic databases, world-based interpretation.
منابع مشابه
Aggregates in Possibilistic Databases
Fuzzy set theory represents a uniform framework for extending the relational database model to han-, dle imprecision of information found in the real world. None of the existing proposals for data models handling imprecision has dealt with queries involvin aggregate operators. This paper presents a framewor for ek handling aggregates in the context of imprecise information. Two kinds of aggrega...
متن کاملPossibilistic Well-Founded Semantics
Recently, a good set of logic programming semantics has been defined for capturing possibilistic logic program. Practically all of them follow a credulous reasoning approach. This means that given a possibilistic logic program one can infer a set of possibilistic models. However, sometimes it is desirable to associate just one possibilistic model to a given possibilistic logic program. One of t...
متن کاملA propos de requêtes possibilistes adressées à des bases de données possibilistes
Querying databases containing imprecise data raises different problems among which that of complexity. In this paper, a new type of query is considered. These queries, called possibilistic queries, are of the form: "to what extent is it possible that tuple t belongs to the answer to query Q", where Q denotes a usual query that may involve selection and join operations. The model used is the rel...
متن کاملPossibilistic and Extended Logic Programs
Based on our earlier work on partial logics and extended logic programs Wag91, Wag94, HJW96], and on the possibilistic logic of DLP94], we deene a compositional possibilistic rst-order logic with two kinds of negation as the logical basis of semi-possibilistic and possibilis-tic logic programs. We show that in the same way as the minimal model semantics of relational databases can be reened to ...
متن کاملDeveloping a multi objective possibilistic programming model for portfolio selection problem
Portfolio selection problem is one of the most important issues in the area of financial management in which is attempted to allocate wealth to different assets with controlling the return and risk. The aim of this paper is to obtain the optimum portfolio with regard to the cardinality and threshold constraints. In the paper, a novel multi-objective possibilistic programming model is developed ...
متن کامل